@inproceedings{DBLP:conf/els/Strandh21,
  author       = {Robert Strandh},
  editor       = {Marco Heisig},
  title        = {{Call-site optimization for Common Lisp}},
  booktitle    = {Proceedings of the 14th European Lisp Symposium, {ELS} 2021, Online,
                  May 3-4, 2021},
  pages        = {72--78},
  publisher    = {{ELSAA}},
  year         = {2021},
  url          = {https://european-lisp-symposium.org/static/proceedings/2021.pdf},
  timestamp    = {Fri, 02 Jun 2023 16:38:05 +0200},
  biburl       = {https://dblp.org/rec/conf/els/Strandh21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}        

@article{10.1145/3213770,
author = {Ousterhout, John},
title = {Always Measure One Level Deeper},
year = {2018},
issue_date = {July 2018},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {61},
number = {7},
issn = {0001-0782},
url = {https://doi.org/10.1145/3213770},
doi = {10.1145/3213770},
abstract = {Performance measurements often go wrong, reporting surface-level results that are more marketing than science.},
journal = {Commun. ACM},
month = jun,
pages = {74–83},
numpages = {10}
}

@Book{Paeke:1993:OOP,
  editor =       "Andreas Paeke",
  title =        "Object-oriented programming: the {CLOS} perspective",
  publisher =    pub-MIT,
  address =      pub-MIT:adr,
  pages =        "viii + 352",
  year =         "1993",
  ISBN =         "0-262-16136-2",
  ISBN-13 =      "978-0-262-16136-7",
  LCCN =         "QA76.64 .O27 1993",
  bibdate =      "Wed Sep 29 06:19:48 1999",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/common-lisp.bib",
  acknowledgement = ack-nhfb,
}

@book{sonya-keene,
  author    = " Sonya E. Keene",
  title     = "Object-Oriented Programming in Common Lisp",
  publisher = "Addison Wesley",
  isbn      = "0201175894",
  year      = 1989
}

@book{Steele:1990:CLL:95411,
 author = {Steele,Jr., Guy L.},
 title = {Common LISP: The Language (2Nd Ed.)},
 year = {1990},
 isbn = {1-55558-041-6},
 publisher = {Digital Press},
 address = {Newton, MA, USA},
}
                  
@inproceedings{durand:hal-02417646,
  TITLE = {{Bootstrapping Common Lisp using Common Lisp}},
  AUTHOR = {Durand, Ir{\`e}ne A. and Strandh, Robert},
  URL = {https://hal.science/hal-02417646},
  BOOKTITLE = {{EUROPEAN LISP SYMPOSIUM}},
  ADDRESS = {GENOVA, Italy},
  YEAR = {2019},
  MONTH = Apr,
  DOI = {10.5281/zenodo.2634314},
  KEYWORDS = {Bootstrapping ; Compilation ; Common Lisp ; CLOS},
  PDF = {https://hal.science/hal-02417646/file/bootstrapping-1.pdf},
  HAL_ID = {hal-02417646},
  HAL_VERSION = {v1},
}

@inproceedings{Strandh:2014:RMI:2635648.2635656,
 author = {Strandh, Robert},
 title = {{Resolving Metastability Issues During Bootstrapping}},
 booktitle = {Proceedings of ILC 2014 on 8th International Lisp Conference},
 series = {ILC '14},
 year = {2014},
 isbn = {978-1-4503-2931-6},
 location = {Montreal, QC, Canada},
 pages = {103:103--103:106},
 articleno = {103},
 numpages = {4},
 url = {http://doi.acm.org/10.1145/2635648.2635656},
 doi = {10.1145/2635648.2635656},
 acmid = {2635656},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Bootstrapping, CLOS, Common Lisp, Metastability},
}

@inproceedings{Strandh:2014:FGD:2635648.2635654,
 author = {Strandh, Robert},
 title = {{Fast Generic Dispatch for Common Lisp}},
 booktitle = {Proceedings of ILC 2014 on 8th International Lisp Conference},
 series = {ILC '14},
 year = {2014},
 isbn = {978-1-4503-2931-6},
 location = {Montreal, QC, Canada},
 pages = {89:89--89:96},
 articleno = {89},
 numpages = {8},
 url = {http://doi.acm.org/10.1145/2635648.2635654},
 doi = {10.1145/2635648.2635654},
 acmid = {2635654},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {CLOS, Common Lisp, Generic dispatch, Method dispatch},
}

@inproceedings{Durand:2017:ELS:Sequence,
 author = {Durand, Irène and Strandh, Robert},
 title = {{Fast, Maintainable, and Portable Sequence Functions}},
 booktitle = {Proceedings of the 10th European Lisp Symposium},
 series = {ELS '17},
 month = {April},
 year = {2017},
 location = {Vrije Universiteit Brussels, Brussels, Belgium},
 pages = {64 -- 71},
 url = {https://www.european-lisp-symposium.org/static/proceedings/2017.pdf}
}

@book{Sedgewick:1996:IAA:227351,
 author = {Sedgewick, Robert and Flajolet, Philippe},
 title = {An introduction to the analysis of algorithms},
 year = {1996},
 isbn = {0-201-40009-X},
 publisher = {Addison-Wesley Longman Publishing Co., Inc.},
 address = {Boston, MA, USA},
} 


@book{McConnell:2007:AA:1374801,
 author = {McConnell, Jeffrey J.},
 title = {Analysis of Algorithms},
 year = {2007},
 isbn = {9780763707828},
 edition = {2},
 publisher = {Jones and Bartlett Publishers, Inc.},
 address = {USA},
} 


@article{Sleator:1985:SBS:3828.3835,
 author = {Sleator, Daniel Dominic and Tarjan, Robert Endre},
 title = {Self-adjusting binary search trees},
 journal = {J. ACM},
 issue_date = {July 1985},
 volume = {32},
 number = {3},
 month = jul,
 year = {1985},
 issn = {0004-5411},
 pages = {652--686},
 numpages = {35},
 url = {http://doi.acm.org/10.1145/3828.3835},
 doi = {10.1145/3828.3835},
 acmid = {3835},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@incollection{Bayer:2002:BDP:944331.944346,
 author = {Bayer, Rudolf},
 chapter = {B-trees and databases, past and future},
 title = {Software pioneers},
 editor = {Broy, Manfred and Denert, Ernst},
 year = {2002},
 isbn = {3-540-43081-4},
 pages = {232--244},
 numpages = {13},
 url = {http://dl.acm.org/citation.cfm?id=944331.944346},
 acmid = {944346},
 publisher = {Springer-Verlag New York, Inc.},
 address = {New York, NY, USA},
} 

@article{Adelson-Velskii_Landis_1962, 
  title = {An algorithm for the organization of information}, 
  volume = {3}, 
  url = {http://en.scientificcommons.org/19884302}, 
  number = {2}, 
  journal = {Soviet Mathematics Doklady}, 
  publisher = {JOINT PUBLICATIONS RESEARCH SERVICE WASHINGTON DC}, 
  author = {Adelson-Velskii, G M and Landis, E M}, 
  year={1962}, 
  pages={263--266}
}
                  
@article{Tan:1972:FIS:361573.361588,
 author = {Tan, K. C.},
 title = {On Foster's information storage and retrieval using AVL trees},
 journal = {Commun. ACM},
 issue_date = {Sept. 1972},
 volume = {15},
 number = {9},
 month = sep,
 year = {1972},
 issn = {0001-0782},
 pages = {843--},
 url = {http://doi.acm.org/10.1145/361573.361588},
 doi = {10.1145/361573.361588},
 acmid = {361588},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {binary trees, information retrieval, information storage, search trees},
} 

@inproceedings{Wilson:1992:UGC:645648.664824,
 author = {Wilson, Paul R.},
 title = {{Uniprocessor Garbage Collection Techniques}},
 booktitle = {Proceedings of the International Workshop on Memory Management},
 series = {IWMM '92},
 year = {1992},
 isbn = {3-540-55940-X},
 pages = {1--42},
 numpages = {42},
 url = {http://dl.acm.org/citation.cfm?id=645648.664824},
 acmid = {664824},
 publisher = {Springer-Verlag},
 address = {London, UK, UK},
} 

@book{Jones:2011:GCH:2025255,
 author = {Jones, Richard and Hosking, Antony and Moss, Eliot},
 title = {The Garbage Collection Handbook: The Art of Automatic Memory Management},
 year = {2011},
 isbn = {1420082795, 9781420082791},
 edition = {1st},
 publisher = {Chapman \& Hall/CRC},
} 

@article{Andersson:1999:GBT:308088.308094,
 author = {Andersson, Arne},
 title = {General balanced trees},
 journal = {J. Algorithms},
 issue_date = {Jan. 1999},
 volume = {30},
 number = {1},
 month = jan,
 year = {1999},
 issn = {0196-6774},
 pages = {1--18},
 numpages = {18},
 url = {http://dx.doi.org/10.1006/jagm.1998.0967},
 doi = {10.1006/jagm.1998.0967},
 acmid = {308094},
 publisher = {Academic Press, Inc.},
 address = {Duluth, MN, USA},
} 

@article{Stout:1986:TRO:6592.6599,
 author = {Stout, Q. F and Warren, B. L},
 title = {Tree rebalancing in optimal time and space},
 journal = {Commun. ACM},
 issue_date = {Sept. 1986},
 volume = {29},
 number = {9},
 month = sep,
 year = {1986},
 issn = {0001-0782},
 pages = {902--908},
 numpages = {7},
 url = {http://doi.acm.org/10.1145/6592.6599},
 doi = {10.1145/6592.6599},
 acmid = {6599},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@article{Waters:1992:UNC:1039991.1039996,
 author = {Waters, Richard C.},
 title = {{Using the new Common Lisp pretty printer}},
 journal = {SIGPLAN Lisp Pointers},
 issue_date = {April-June 1992},
 volume = {V},
 number = {2},
 month = apr,
 year = {1992},
 issn = {1045-3563},
 pages = {27--34},
 numpages = {8},
 url = {http://doi.acm.org/10.1145/1039991.1039996},
 doi = {10.1145/1039991.1039996},
 acmid = {1039996},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@INPROCEEDINGS{Waters89xp:a,
    author = {Richard C. Waters},
    title = {{XP: A Common Lisp Pretty Printing System}},
    booktitle = {A.I. Memo 1102a, MIT Artificial Intelligence Laboratory},
    year = {1989}
}

BibTeX | BibTeX (beta) | EndNote | ACM Ref

@techreport{Huang:1990:FSM:898863,
 author = {Huang, Bing and Langston, Michael A.},
 title = {{Fast Stable Merging and Sorting in Constant Extra Space}},
 year = {1990},
 source = {http://www.ncstrl.org:8900/ncstrl/servlet/search?formname=detail\&id=oai%3Ancstrlh%3Autk_cs%3Ancstrl.utk_cs%2F%2FUT-CS-90-106},
 publisher = {University of Tennessee},
 address = {Knoxville, TN, USA},
} 

@InProceedings{10.1007/978-3-540-30140-0_63,
author="Kim, Pok-Son
and Kutzner, Arne",
editor="Albers, Susanne
and Radzik, Tomasz",
title="Stable Minimum Storage Merging by Symmetric Comparisons",
booktitle="Algorithms -- ESA 2004",
year="2004",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="714--723",
abstract="We introduce a new stable minimum storage algorithm for merging that needs {\$}O(m{\backslash}log({\backslash}frac{\{}n{\}}{\{}m{\}}+1)){\$}element comparisons, where m and n are the sizes of the input sequences with m≤ n. According to the lower bound for merging, our algorithm is asymptotically optimal regarding the number of comparisons.",
isbn="978-3-540-30140-0"
}
        

@article{Huang:1988:PIM:42392.42403,
 author = {Huang, Bing-Chao and Langston, Michael A.},
 title = {Practical in-place merging},
 journal = {Commun. ACM},
 issue_date = {March 1988},
 volume = {31},
 number = {3},
 month = mar,
 year = {1988},
 issn = {0001-0782},
 pages = {348--352},
 numpages = {5},
 url = {http://doi.acm.org/10.1145/42392.42403},
 doi = {10.1145/42392.42403},
 acmid = {42403},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@article{Katajainen:1996:PIM:642136.642138,
 author = {Katajainen, Jyrki and Pasanen, Tomi and Teuhola, Jukka},
 title = {Practical in-place mergesort},
 journal = {Nordic J. of Computing},
 issue_date = {Spring 1996},
 volume = {3},
 number = {1},
 month = mar,
 year = {1996},
 issn = {1236-6064},
 pages = {27--40},
 numpages = {14},
 url = {http://dl.acm.org/citation.cfm?id=642136.642138},
 acmid = {642138},
 publisher = {Publishing Association Nordic Journal of Computing},
 address = {Finland},
 keywords = {in-place algorithms, mergesort, sorting},
} 

@inproceedings{Clinger:1990:RFP:93542.93557,
 author = {Clinger, William D.},
 title = {How to read floating point numbers accurately},
 booktitle = {Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation},
 series = {PLDI '90},
 year = {1990},
 isbn = {0-89791-364-7},
 location = {White Plains, New York, USA},
 pages = {92--101},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/93542.93557},
 doi = {10.1145/93542.93557},
 acmid = {93557},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@article{Adams:2018:RFF:3296979.3192369,
 author = {Adams, Ulf},
 title = {Ry\={u}: Fast Float-to-string Conversion},
 journal = {SIGPLAN Not.},
 issue_date = {April 2018},
 volume = {53},
 number = {4},
 month = jun,
 year = {2018},
 issn = {0362-1340},
 pages = {270--282},
 numpages = {13},
 url = {http://doi.acm.org/10.1145/3296979.3192369},
 doi = {10.1145/3296979.3192369},
 acmid = {3192369},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {float, performance, string},
}                  

@inproceedings{Burger:1996:PFN:231379.231397,
 author = {Burger, Robert G. and Dybvig, R. Kent},
 title = {Printing floating-point numbers quickly and accurately},
 booktitle = {Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation},
 series = {PLDI '96},
 year = {1996},
 isbn = {0-89791-795-2},
 location = {Philadelphia, Pennsylvania, USA},
 pages = {108--116},
 numpages = {9},
 url = {http://doi.acm.org/10.1145/231379.231397},
 doi = {10.1145/231379.231397},
 acmid = {231397},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {floating-point printing, run-time systems},
} 

@TECHREPORT{Gay90correctlyrounded,
    author = {David M. Gay},
    title = {Correctly Rounded Binary-Decimal and Decimal-Binary Conversions},
    institution = {Numerical Analysis Manuscript 90-10, AT\&T Bell Laboratories},
    year = {1990}
}

@inproceedings{Doligez:1993:CGG:158511.158611,
 author = {Doligez, Damien and Leroy, Xavier},
 title = {A concurrent, generational garbage collector for a multithreaded implementation of ML},
 booktitle = {Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages},
 series = {POPL '93},
 year = {1993},
 isbn = {0-89791-560-7},
 location = {Charleston, South Carolina, USA},
 pages = {113--123},
 numpages = {11},
 url = {http://doi.acm.org/10.1145/158511.158611},
 doi = {10.1145/158511.158611},
 acmid = {158611},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@book{Kiczales:1991:AMP:574212,
 author = {Kiczales, Gregor and Rivieres, Jim Des},
 title = {The  Art of the Metaobject Protocol},
 year = {1991},
 isbn = {0262111586},
 publisher = {MIT Press},
 address = {Cambridge, MA, USA},
} 

@book{Muchnick:1998:ACD:286076,
 author = {Muchnick, Steven S.},
 title = {Advanced compiler design and implementation},
 year = {1997},
 isbn = {1-55860-320-4},
 publisher = {Morgan Kaufmann Publishers Inc.},
 address = {San Francisco, CA, USA},
}

@article{Kermany:2006:CCI:1133255.1134023,
 author = {Kermany, Haim and Petrank, Erez},
 title = {The Compressor: Concurrent, Incremental, and Parallel Compaction},
 journal = {SIGPLAN Not.},
 issue_date = {June 2006},
 volume = {41},
 number = {6},
 month = jun,
 year = {2006},
 issn = {0362-1340},
 pages = {354--363},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/1133255.1134023},
 doi = {10.1145/1133255.1134023},
 acmid = {1134023},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {compaction, concurrent garbage collection, garbage collection, memory management, runtime systems},
}

@inproceedings{Kermany:2006:CCI:1133981.1134023,
 author = {Kermany, Haim and Petrank, Erez},
 title = {The Compressor: Concurrent, Incremental, and Parallel Compaction},
 booktitle = {Proceedings of the 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation},
 series = {PLDI '06},
 year = {2006},
 isbn = {1-59593-320-4},
 location = {Ottawa, Ontario, Canada},
 pages = {354--363},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/1133981.1134023},
 doi = {10.1145/1133981.1134023},
 acmid = {1134023},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {compaction, concurrent garbage collection, garbage collection, memory management, runtime systems},
}
